Correct diagnosis of almost all faulty units in a multiprocessor system

نویسندگان

  • Krishnaiyan Thulasiraman
  • Anindya Das
  • Kaiyuan Huang
  • Vinod K. Agarwal
چکیده

In a t/t-diagnosable system all faulty units can be located to within a set of no more than t units as long as the number of faulty units present does not exceed t. Furthermore, a unique doubtful unit can be identified; in other words, all faulty units, except possibly for one, can be correctly identified in a U-diagnosable system. An open question is "is t/t-diagnosability necessary for correctly identifying all but one faulty unit?" In this paper we address the above question and provide an answer. We establish necessary and sufficient conditions for correct diagnosis of all except possibly one faulty unit. In addition, we show that the faulty-free state is indistinguishable from a faulty state in a t/t-diagnosable system and propose a remedy. These considerations result in the definition and characterization of a new class of systems called t/-1 diagnosable systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluation of a Diagnosis Algorithm for Regular Structures

ÐThe problem of identifying the faulty units in regularly interconnected systems is addressed. The diagnosis is based on mutual tests of units, which are adjacent in the asystem grapho describing the interconnection structure. This paper evaluates an algorithm named EDARS (Efficient Diagnosis Algorithm for Regular Structures). The diagnosis provided by this algorithm is provably correct and alm...

متن کامل

A diagnosis algorithm by using graph-coloring under the PMC model

Fault diagnosis is important to the design and maintenance of large multiprocessor systems. PMCmodel is themostwell known andwidely studiedmodel in the system level diagnosis of multiprocessor systems. Under the PMCmodel, a diagnosis algorithm based on some graph-coloring techniques has been proposed in this paper. Given a syndrome σ , the first part of the algorithm can locate all the definite...

متن کامل

On diagnosability of large multiprocessor networks

We consider problems of fault diagnosis in multiprocessor systems. Preparata, Metze and Chien (1967) introduced a graph theoretical model for system-level diagnosis, in which processors perform tests on one another via links in the system. Faultfree processors correctly identify the status of tested processors, while the faulty processors can give arbitrary test results. The goal is to identify...

متن کامل

6hoi 9dolgdwlqj 'ldjqrvlv Ri +\shufxeh 6\vwhpv

A novel approach to the diagnosis of hypercubes, called Self-Validating Diagnosis, is introduced. An algorithm based on this approach, called SVD algorithm, is presented and evaluated. Given any fault set and the resulting syndrome, the algorithm returns a diagnosis and a syndrome-dependent bound, Tσ, with the property that diagnosis is correct (although possibly incomplete) if the actual numbe...

متن کامل

Effective Approximate Fault Diagnosis of Systems with Inhomogeneous Test Invalidation

failed components in the system. In large multiprocessors a circuit-level fault diagnosis is impractical, therefore system-level diagnosis considers only processor faults. Processors periodically execute tests on each other. If an error was detected, the diagnostic procedure identifies faulty units by analyzing the collection of the test results (called the syndrome). Once these units were iden...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998